[INFO] cloning repository https://github.com/imtherealnaska/prep
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/imtherealnaska/prep" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fimtherealnaska%2Fprep", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fimtherealnaska%2Fprep'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 4b433651b98951aa11e6f469d5d2a9ce9e36f460
[INFO] fixing imtherealnaska/prep against try#622891a4e29178280638a6b63a8908bde2c0c854+cargoflags=-Zfix-edition=start=2015 for pr-157817-2
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fimtherealnaska%2Fprep" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/imtherealnaska/prep
[INFO] finished tweaking git repo https://github.com/imtherealnaska/prep
[INFO] tweaked toml for git repo https://github.com/imtherealnaska/prep written to /workspace/builds/worker-0-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/imtherealnaska/prep on toolchain 622891a4e29178280638a6b63a8908bde2c0c854
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+622891a4e29178280638a6b63a8908bde2c0c854" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/imtherealnaska/prep already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+622891a4e29178280638a6b63a8908bde2c0c854" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-m" "1610612736" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:3a6becf2bc8dde7f3fa57ede90e4f284e72d296796fc446bbb1e2c7cc0530151" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] fcef6ed6c7be26e538501302a073e9dc7bdb202cf4d9cb6c3769c33a3b7e46c5
[INFO] running `Command { std: "docker" "start" "fcef6ed6c7be26e538501302a073e9dc7bdb202cf4d9cb6c3769c33a3b7e46c5", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-w" "/opt/rustwide/workdir" "--user" "0:0" "fcef6ed6c7be26e538501302a073e9dc7bdb202cf4d9cb6c3769c33a3b7e46c5" "/opt/rustwide/cargo-home/bin/cargo" "+622891a4e29178280638a6b63a8908bde2c0c854" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "fcef6ed6c7be26e538501302a073e9dc7bdb202cf4d9cb6c3769c33a3b7e46c5", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=" "-e" "RUSTDOCFLAGS=" "-w" "/opt/rustwide/workdir" "--user" "0:0" "fcef6ed6c7be26e538501302a073e9dc7bdb202cf4d9cb6c3769c33a3b7e46c5" "/opt/rustwide/cargo-home/bin/cargo" "+622891a4e29178280638a6b63a8908bde2c0c854" "fix" "--allow-no-vcs" "--allow-dirty" "--frozen" "--all" "--all-targets" "--message-format=json" "-Zfix-edition=start=2015", kill_on_drop: false }`
[INFO] [stderr]     Checking top_interview_150_1 v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] error: expected `;`, found keyword `let`
[INFO] [stdout]  --> src/month_1/week2/trees/dfs/medium/cousins_in_bin_tree.rs:6:6
[INFO] [stdout]   |
[INFO] [stdout] 6 |     }
[INFO] [stdout]   |      ^ help: add `;` here
[INFO] [stdout] 7 |
[INFO] [stdout] 8 |     let mut level_sum = 0 ;
[INFO] [stdout]   |     --- unexpected token
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: expected `;`, found keyword `let`
[INFO] [stdout]  --> src/month_1/week2/trees/dfs/medium/cousins_in_bin_tree.rs:6:6
[INFO] [stdout]   |
[INFO] [stdout] 6 |     }
[INFO] [stdout]   |      ^ help: add `;` here
[INFO] [stdout] 7 |
[INFO] [stdout] 8 |     let mut level_sum = 0 ;
[INFO] [stdout]   |     --- unexpected token
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find value `char_set` in this scope
[INFO] [stdout]   --> src/month_1/week1/strings/medium/encode_decode.rs:68:13
[INFO] [stdout]    |
[INFO] [stdout] 56 |     char_set: Vec<char>,
[INFO] [stdout]    |     -------- a field by that name exists in `Self`
[INFO] [stdout] ...
[INFO] [stdout] 68 |             char_set,
[INFO] [stdout]    |             ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] help: a local variable with a similar name exists
[INFO] [stdout]    |
[INFO] [stdout] 68 -             char_set,
[INFO] [stdout] 68 +             charset,
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find value `take_from_front` in this scope
[INFO] [stdout]   --> src/month_1/week2/stack/medium/reorder_ll.rs:23:22
[INFO] [stdout]    |
[INFO] [stdout] 23 |         let val = if take_from_front {
[INFO] [stdout]    |                      ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] help: a local variable with a similar name exists
[INFO] [stdout]    |
[INFO] [stdout] 23 -         let val = if take_from_front {
[INFO] [stdout] 23 +         let val = if take_from_font {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `dfs_helper` in this scope
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/binary_tree_path.rs:6:5
[INFO] [stdout]    |
[INFO] [stdout]  6 |     dfs_helper(&root, &mut result, &mut current_path);
[INFO] [stdout]    |     ^^^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] note: these functions exist but are inaccessible
[INFO] [stdout]   --> src/month_1/week2/trees/bfs/two_sum_bst.rs:10:1
[INFO] [stdout]    |
[INFO] [stdout] 10 |   fn dfs_helper(node: &TreeType, k: i32, seen: &mut HashSet<i32>) -> bool {
[INFO] [stdout]    |   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `crate::month_1::week2::trees::bfs::two_sum_bst::dfs_helper`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/month_1/week2/trees/dfs/easy/cousins.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | / fn dfs_helper(
[INFO] [stdout] 22 | |     node: &TreeType,
[INFO] [stdout] 23 | |     target: i32,
[INFO] [stdout] 24 | |     parent_val: Option<i32>,
[INFO] [stdout] ...  |
[INFO] [stdout] 42 | | }
[INFO] [stdout]    | |_^ `crate::month_1::week2::trees::dfs::easy::cousins::dfs_helper`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/month_1/week2/trees/dfs/easy/diameter.rs:9:1
[INFO] [stdout]    |
[INFO] [stdout]  9 |   fn dfs_helper(node: &TreeType, max_diameter: &mut i32) -> i32 {
[INFO] [stdout]    |   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `crate::month_1::week2::trees::dfs::easy::diameter::dfs_helper`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/month_1/week2/trees/dfs/easy/root_to_leaf_sum.rs:7:1
[INFO] [stdout]    |
[INFO] [stdout]  7 |   fn dfs_helper(node: &TreeType, current_sum: i32) -> i32 {
[INFO] [stdout]    |   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `crate::month_1::week2::trees::dfs::easy::root_to_leaf_sum::dfs_helper`: not accessible
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]    |
[INFO] [stdout]  1 + use crate::backtracking::easy::binary_tree_leaf_path::dfs_helper;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find value `node` in this scope
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/count_complete_trees.rs:23:11
[INFO] [stdout]    |
[INFO] [stdout] 23 |     match node {
[INFO] [stdout]    |           ^^^^ not found in this scope
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find value `node` in this scope
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/count_complete_trees.rs:30:11
[INFO] [stdout]    |
[INFO] [stdout] 30 |     match node {
[INFO] [stdout]    |           ^^^^ not found in this scope
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::num`
[INFO] [stdout]  --> src/backtracking/medium/permutations.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::num;
[INFO] [stdout]   |     ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::LinkedList`
[INFO] [stdout]  --> src/month_1/week1/ll/singly/medium/delete_dup.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::LinkedList;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `marker`
[INFO] [stdout]  --> src/month_1/week1/ll/singly/medium/matrix_spiral.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{marker, usize};
[INFO] [stdout]   |           ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find value `char_set` in this scope
[INFO] [stdout]   --> src/month_1/week1/strings/medium/encode_decode.rs:68:13
[INFO] [stdout]    |
[INFO] [stdout] 56 |     char_set: Vec<char>,
[INFO] [stdout]    |     -------- a field by that name exists in `Self`
[INFO] [stdout] ...
[INFO] [stdout] 68 |             char_set,
[INFO] [stdout]    |             ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] help: a local variable with a similar name exists
[INFO] [stdout]    |
[INFO] [stdout] 68 -             char_set,
[INFO] [stdout] 68 +             charset,
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week2::queue`
[INFO] [stdout]  --> src/month_1/week2/queue/med/revel_deck_cards.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use crate::month_1::week2::queue;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `fmt::Binary`
[INFO] [stdout]  --> src/month_1/week2/stack/next_greater.rs:1:33
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{collections::HashMap, fmt::Binary};
[INFO] [stdout]   |                                 ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/clumsy.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::VecDeque;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VecDeque`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/remove_dupicates.rs:3:37
[INFO] [stdout]   |
[INFO] [stdout] 3 |     collections::{HashMap, HashSet, VecDeque},
[INFO] [stdout]   |                                     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week1::arrays::easy::interval_problem_meeting::interval_problem_meeting`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/remove_dupicates.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::month_1::week1::arrays::easy::interval_problem_meeting::interval_problem_meeting;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/remove_k_digits.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::VecDeque;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week2::stack`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/remove_k_digits.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use crate::month_1::week2::stack;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fmt::Pointer`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/reoder_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fmt::Pointer;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week4::heaps::easy::largest_number_digit_swaps`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/shortest_unsorted_array.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::month_1::week4::heaps::easy::largest_number_digit_swaps;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `mem::take` and `thread::current`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/reorder_ll.rs:1:34
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{collections::VecDeque, mem::take, thread::current};
[INFO] [stdout]   |                                  ^^^^^^^^^  ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week2::trees::bst::TreeType`
[INFO] [stdout]  --> src/month_1/week2/trees/bin_search_tree/medium/delete_node.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use crate::month_1::week2::trees::bst::TreeType;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find value `take_from_front` in this scope
[INFO] [stdout]   --> src/month_1/week2/stack/medium/reorder_ll.rs:23:22
[INFO] [stdout]    |
[INFO] [stdout] 23 |         let val = if take_from_front {
[INFO] [stdout]    |                      ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] help: a local variable with a similar name exists
[INFO] [stdout]    |
[INFO] [stdout] 23 -         let val = if take_from_front {
[INFO] [stdout] 23 +         let val = if take_from_font {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BorrowError`
[INFO] [stdout]  --> src/month_1/week2/trees/bin_search_tree/medium/delete_node.rs:3:17
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::cell::{BorrowError, RefCell};
[INFO] [stdout]   |                 ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/month_1/week2/trees/dfs/medium/pop_next_right.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::intrinsics::bitreverse`
[INFO] [stdout]  --> src/month_1/week2/trees/dfs/medium/pop_next_right.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::intrinsics::bitreverse;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `mem`
[INFO] [stdout]  --> src/month_2/dp/easy/climbing_stairs.rs:1:33
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{collections::HashMap, mem};
[INFO] [stdout]   |                                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `dfs_helper` in this scope
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/binary_tree_path.rs:6:5
[INFO] [stdout]    |
[INFO] [stdout]  6 |     dfs_helper(&root, &mut result, &mut current_path);
[INFO] [stdout]    |     ^^^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] note: these functions exist but are inaccessible
[INFO] [stdout]   --> src/month_1/week2/trees/bfs/two_sum_bst.rs:10:1
[INFO] [stdout]    |
[INFO] [stdout] 10 |   fn dfs_helper(node: &TreeType, k: i32, seen: &mut HashSet<i32>) -> bool {
[INFO] [stdout]    |   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `crate::month_1::week2::trees::bfs::two_sum_bst::dfs_helper`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/month_1/week2/trees/dfs/easy/cousins.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | / fn dfs_helper(
[INFO] [stdout] 22 | |     node: &TreeType,
[INFO] [stdout] 23 | |     target: i32,
[INFO] [stdout] 24 | |     parent_val: Option<i32>,
[INFO] [stdout] ...  |
[INFO] [stdout] 42 | | }
[INFO] [stdout]    | |_^ `crate::month_1::week2::trees::dfs::easy::cousins::dfs_helper`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/month_1/week2/trees/dfs/easy/diameter.rs:9:1
[INFO] [stdout]    |
[INFO] [stdout]  9 |   fn dfs_helper(node: &TreeType, max_diameter: &mut i32) -> i32 {
[INFO] [stdout]    |   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `crate::month_1::week2::trees::dfs::easy::diameter::dfs_helper`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/month_1/week2/trees/dfs/easy/root_to_leaf_sum.rs:7:1
[INFO] [stdout]    |
[INFO] [stdout]  7 |   fn dfs_helper(node: &TreeType, current_sum: i32) -> i32 {
[INFO] [stdout]    |   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `crate::month_1::week2::trees::dfs::easy::root_to_leaf_sum::dfs_helper`: not accessible
[INFO] [stdout] help: consider importing this function
[INFO] [stdout]    |
[INFO] [stdout]  1 + use crate::backtracking::easy::binary_tree_leaf_path::dfs_helper;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::io::Seek`
[INFO] [stdout]  --> src/month_2/dp/book/lcs.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::io::Seek;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week1::arrays::easy::ds_two_sum`
[INFO] [stdout]  --> src/month_3/shortest_path/network_delay.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::month_1::week1::arrays::easy::ds_two_sum;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find value `node` in this scope
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/count_complete_trees.rs:23:11
[INFO] [stdout]    |
[INFO] [stdout] 23 |     match node {
[INFO] [stdout]    |           ^^^^ not found in this scope
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find value `node` in this scope
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/count_complete_trees.rs:30:11
[INFO] [stdout]    |
[INFO] [stdout] 30 |     match node {
[INFO] [stdout]    |           ^^^^ not found in this scope
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::num`
[INFO] [stdout]  --> src/backtracking/medium/permutations.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::num;
[INFO] [stdout]   |     ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::LinkedList`
[INFO] [stdout]  --> src/month_1/week1/ll/singly/medium/delete_dup.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::LinkedList;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `marker`
[INFO] [stdout]  --> src/month_1/week1/ll/singly/medium/matrix_spiral.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{marker, usize};
[INFO] [stdout]   |           ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week2::queue`
[INFO] [stdout]  --> src/month_1/week2/queue/med/revel_deck_cards.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use crate::month_1::week2::queue;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `fmt::Binary`
[INFO] [stdout]  --> src/month_1/week2/stack/next_greater.rs:1:33
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{collections::HashMap, fmt::Binary};
[INFO] [stdout]   |                                 ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/clumsy.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::VecDeque;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VecDeque`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/remove_dupicates.rs:3:37
[INFO] [stdout]   |
[INFO] [stdout] 3 |     collections::{HashMap, HashSet, VecDeque},
[INFO] [stdout]   |                                     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week1::arrays::easy::interval_problem_meeting::interval_problem_meeting`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/remove_dupicates.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::month_1::week1::arrays::easy::interval_problem_meeting::interval_problem_meeting;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/remove_k_digits.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::VecDeque;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week2::stack`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/remove_k_digits.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use crate::month_1::week2::stack;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::fmt::Pointer`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/reoder_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::fmt::Pointer;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week4::heaps::easy::largest_number_digit_swaps`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/shortest_unsorted_array.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::month_1::week4::heaps::easy::largest_number_digit_swaps;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `mem::take` and `thread::current`
[INFO] [stdout]  --> src/month_1/week2/stack/medium/reorder_ll.rs:1:34
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{collections::VecDeque, mem::take, thread::current};
[INFO] [stdout]   |                                  ^^^^^^^^^  ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week2::trees::bst::TreeType`
[INFO] [stdout]  --> src/month_1/week2/trees/bin_search_tree/medium/delete_node.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use crate::month_1::week2::trees::bst::TreeType;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BorrowError`
[INFO] [stdout]  --> src/month_1/week2/trees/bin_search_tree/medium/delete_node.rs:3:17
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::cell::{BorrowError, RefCell};
[INFO] [stdout]   |                 ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Ref`
[INFO] [stdout]  --> src/month_1/week2/trees/dfs/medium/pop_next_right.rs:1:17
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::{Ref, RefCell};
[INFO] [stdout]   |                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::intrinsics::bitreverse`
[INFO] [stdout]  --> src/month_1/week2/trees/dfs/medium/pop_next_right.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::intrinsics::bitreverse;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `mem`
[INFO] [stdout]  --> src/month_2/dp/easy/climbing_stairs.rs:1:33
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{collections::HashMap, mem};
[INFO] [stdout]   |                                 ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::io::Seek`
[INFO] [stdout]  --> src/month_2/dp/book/lcs.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::io::Seek;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::month_1::week1::arrays::easy::ds_two_sum`
[INFO] [stdout]  --> src/month_3/shortest_path/network_delay.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::month_1::week1::arrays::easy::ds_two_sum;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0658]: use of unstable library feature `core_intrinsics`: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library
[INFO] [stdout]  --> src/month_1/week2/trees/dfs/medium/pop_next_right.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::intrinsics::bitreverse;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: add `#![feature(core_intrinsics)]` to the crate attributes to enable
[INFO] [stdout]   = note: this compiler was built on 2026-06-16; consider upgrading it if it is out of date
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0658]: use of unstable library feature `core_intrinsics`: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library
[INFO] [stdout]  --> src/month_1/week2/trees/dfs/medium/pop_next_right.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use std::intrinsics::bitreverse;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: add `#![feature(core_intrinsics)]` to the crate attributes to enable
[INFO] [stdout]   = note: this compiler was built on 2026-06-16; consider upgrading it if it is out of date
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0592]: duplicate definitions with name `new`
[INFO] [stdout]   --> src/month_1/week2/stack/queue_stack.rs:9:5
[INFO] [stdout]    |
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^ duplicate definitions for `new`
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn new() -> Self {
[INFO] [stdout]    |     ---------------- other definition for `new`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0592]: duplicate definitions with name `push`
[INFO] [stdout]   --> src/month_1/week2/stack/queue_stack.rs:16:5
[INFO] [stdout]    |
[INFO] [stdout] 16 |     fn push(&self, x: i32) {
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^ duplicate definitions for `push`
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn push(&self, x: i32) {
[INFO] [stdout]    |     ---------------------- other definition for `push`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0592]: duplicate definitions with name `empty`
[INFO] [stdout]   --> src/month_1/week2/stack/queue_stack.rs:37:5
[INFO] [stdout]    |
[INFO] [stdout] 37 |     fn empty(&self) -> bool {
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^ duplicate definitions for `empty`
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn empty(&self) -> bool {
[INFO] [stdout]    |     ----------------------- other definition for `empty`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0592]: duplicate definitions with name `new`
[INFO] [stdout]   --> src/month_1/week2/stack/queue_stack.rs:9:5
[INFO] [stdout]    |
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^ duplicate definitions for `new`
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn new() -> Self {
[INFO] [stdout]    |     ---------------- other definition for `new`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0592]: duplicate definitions with name `push`
[INFO] [stdout]   --> src/month_1/week2/stack/queue_stack.rs:16:5
[INFO] [stdout]    |
[INFO] [stdout] 16 |     fn push(&self, x: i32) {
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^ duplicate definitions for `push`
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn push(&self, x: i32) {
[INFO] [stdout]    |     ---------------------- other definition for `push`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0592]: duplicate definitions with name `empty`
[INFO] [stdout]   --> src/month_1/week2/stack/queue_stack.rs:37:5
[INFO] [stdout]    |
[INFO] [stdout] 37 |     fn empty(&self) -> bool {
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^ duplicate definitions for `empty`
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn empty(&self) -> bool {
[INFO] [stdout]    |     ----------------------- other definition for `empty`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/backtracking/medium/aditive_number.rs:25:90
[INFO] [stdout]    |
[INFO] [stdout] 25 | fn check_seq(num: &str , start1 : usize , end : usize , start2: usize , end2 : usize) -> bool {
[INFO] [stdout]    |    --------- implicitly returns `()` as its body has no tail or `return` expression      ^^^^ expected `bool`, found `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/backtracking/medium/beautiful_strings.rs:1:36
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn beautiful_strings(s: String) -> i32 {
[INFO] [stdout]   |    -----------------               ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/backtracking/medium/aditive_number.rs:25:90
[INFO] [stdout]    |
[INFO] [stdout] 25 | fn check_seq(num: &str , start1 : usize , end : usize , start2: usize , end2 : usize) -> bool {
[INFO] [stdout]    |    --------- implicitly returns `()` as its body has no tail or `return` expression      ^^^^ expected `bool`, found `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/backtracking/medium/beautiful_strings.rs:1:36
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn beautiful_strings(s: String) -> i32 {
[INFO] [stdout]   |    -----------------               ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0277]: the trait bound `String: Borrow<&str>` is not satisfied
[INFO] [stdout]    --> src/month_1/week1/strings/medium/encode_decode.rs:128:18
[INFO] [stdout]     |
[INFO] [stdout] 128 |             .get(&code)
[INFO] [stdout]     |              --- ^^^^^ the trait `Borrow<&str>` is not implemented for `String`
[INFO] [stdout]     |              |
[INFO] [stdout]     |              required by a bound introduced by this call
[INFO] [stdout]     |
[INFO] [stdout] help: the trait `Borrow<&_>` is not implemented for `String`
[INFO] [stdout]       but trait `Borrow<_>` is implemented for it
[INFO] [stdout]    --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/alloc/src/str.rs:229:0
[INFO] [stdout]     = help: for that trait implementation, expected `str`, found `&str`
[INFO] [stdout] note: required by a bound in `HashMap::<K, V, S, A>::get`
[INFO] [stdout]    --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/std/src/collections/hash/map.rs:1035:4
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0277]: the trait bound `String: Borrow<&str>` is not satisfied
[INFO] [stdout]    --> src/month_1/week1/strings/medium/encode_decode.rs:128:18
[INFO] [stdout]     |
[INFO] [stdout] 128 |             .get(&code)
[INFO] [stdout]     |              --- ^^^^^ the trait `Borrow<&str>` is not implemented for `String`
[INFO] [stdout]     |              |
[INFO] [stdout]     |              required by a bound introduced by this call
[INFO] [stdout]     |
[INFO] [stdout] help: the trait `Borrow<&_>` is not implemented for `String`
[INFO] [stdout]       but trait `Borrow<_>` is implemented for it
[INFO] [stdout]    --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/alloc/src/str.rs:229:0
[INFO] [stdout]     = help: for that trait implementation, expected `str`, found `&str`
[INFO] [stdout] note: required by a bound in `HashMap::<K, V, S, A>::get`
[INFO] [stdout]    --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/std/src/collections/hash/map.rs:1035:4
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `is_full` found for mutable reference `&mut MyCircularDeque` in the current scope
[INFO] [stdout]   --> src/month_1/week2/queue/med/design_cirular_deq.rs:21:17
[INFO] [stdout]    |
[INFO] [stdout] 21 |         if self.is_full() {
[INFO] [stdout]    |                 ^^^^^^^ method not found in `&mut MyCircularDeque`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `is_full` found for mutable reference `&mut MyCircularDeque` in the current scope
[INFO] [stdout]   --> src/month_1/week2/queue/med/design_cirular_deq.rs:21:17
[INFO] [stdout]    |
[INFO] [stdout] 21 |         if self.is_full() {
[INFO] [stdout]    |                 ^^^^^^^ method not found in `&mut MyCircularDeque`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `isempty` found for mutable reference `&mut MyCircularDeque` in the current scope
[INFO] [stdout]   --> src/month_1/week2/queue/med/design_cirular_deq.rs:24:18
[INFO] [stdout]    |
[INFO] [stdout] 24 |         if !self.isempty() {
[INFO] [stdout]    |                  ^^^^^^^ method not found in `&mut MyCircularDeque`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `isempty` found for mutable reference `&mut MyCircularDeque` in the current scope
[INFO] [stdout]   --> src/month_1/week2/queue/med/design_cirular_deq.rs:24:18
[INFO] [stdout]    |
[INFO] [stdout] 24 |         if !self.isempty() {
[INFO] [stdout]    |                  ^^^^^^^ method not found in `&mut MyCircularDeque`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:55:29
[INFO] [stdout]    |
[INFO] [stdout] 55 |             self.stack.push(n);
[INFO] [stdout]    |                        ---- ^ expected `subtree_of_tree::TreeNode`, found `bst::TreeNode`
[INFO] [stdout]    |                        |
[INFO] [stdout]    |                        arguments to this method are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: `bst::TreeNode` and `subtree_of_tree::TreeNode` have similar names, but are actually distinct types
[INFO] [stdout] note: `bst::TreeNode` is defined in module `crate::month_1::week2::trees::bst` of the current crate
[INFO] [stdout]   --> src/month_1/week2/trees/bst/mod.rs:12:1
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub struct TreeNode {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] note: `subtree_of_tree::TreeNode` is defined in module `crate::month_1::week1::medium::subtree_of_tree` of the current crate
[INFO] [stdout]   --> src/month_1/week1/medium/subtree_of_tree.rs:4:1
[INFO] [stdout]    |
[INFO] [stdout]  4 | pub struct TreeNode {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] note: method defined here
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/alloc/src/vec/mod.rs:1003:11
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:55:29
[INFO] [stdout]    |
[INFO] [stdout] 55 |             self.stack.push(n);
[INFO] [stdout]    |                        ---- ^ expected `subtree_of_tree::TreeNode`, found `bst::TreeNode`
[INFO] [stdout]    |                        |
[INFO] [stdout]    |                        arguments to this method are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: `bst::TreeNode` and `subtree_of_tree::TreeNode` have similar names, but are actually distinct types
[INFO] [stdout] note: `bst::TreeNode` is defined in module `crate::month_1::week2::trees::bst` of the current crate
[INFO] [stdout]   --> src/month_1/week2/trees/bst/mod.rs:12:1
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub struct TreeNode {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] note: `subtree_of_tree::TreeNode` is defined in module `crate::month_1::week1::medium::subtree_of_tree` of the current crate
[INFO] [stdout]   --> src/month_1/week1/medium/subtree_of_tree.rs:4:1
[INFO] [stdout]    |
[INFO] [stdout]  4 | pub struct TreeNode {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] note: method defined here
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/alloc/src/vec/mod.rs:1003:11
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:65:28
[INFO] [stdout]    |
[INFO] [stdout] 65 |         self.push_left_rev(right);
[INFO] [stdout]    |              ------------- ^^^^^ expected `bst::TreeNode`, found `subtree_of_tree::TreeNode`
[INFO] [stdout]    |              |
[INFO] [stdout]    |              arguments to this method are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: `subtree_of_tree::TreeNode` and `bst::TreeNode` have similar names, but are actually distinct types
[INFO] [stdout] note: `subtree_of_tree::TreeNode` is defined in module `crate::month_1::week1::medium::subtree_of_tree` of the current crate
[INFO] [stdout]   --> src/month_1/week1/medium/subtree_of_tree.rs:4:1
[INFO] [stdout]    |
[INFO] [stdout]  4 | pub struct TreeNode {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] note: `bst::TreeNode` is defined in module `crate::month_1::week2::trees::bst` of the current crate
[INFO] [stdout]   --> src/month_1/week2/trees/bst/mod.rs:12:1
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub struct TreeNode {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] note: method defined here
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 |     fn push_left_rev(&mut self, mut node: TreeType) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^            ------------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:65:28
[INFO] [stdout]    |
[INFO] [stdout] 65 |         self.push_left_rev(right);
[INFO] [stdout]    |              ------------- ^^^^^ expected `bst::TreeNode`, found `subtree_of_tree::TreeNode`
[INFO] [stdout]    |              |
[INFO] [stdout]    |              arguments to this method are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: `subtree_of_tree::TreeNode` and `bst::TreeNode` have similar names, but are actually distinct types
[INFO] [stdout] note: `subtree_of_tree::TreeNode` is defined in module `crate::month_1::week1::medium::subtree_of_tree` of the current crate
[INFO] [stdout]   --> src/month_1/week1/medium/subtree_of_tree.rs:4:1
[INFO] [stdout]    |
[INFO] [stdout]  4 | pub struct TreeNode {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] note: `bst::TreeNode` is defined in module `crate::month_1::week2::trees::bst` of the current crate
[INFO] [stdout]   --> src/month_1/week2/trees/bst/mod.rs:12:1
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub struct TreeNode {
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] note: method defined here
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 |     fn push_left_rev(&mut self, mut node: TreeType) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^            ------------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bfs/medium/reverse_odd_level.rs:50:10
[INFO] [stdout]    |
[INFO] [stdout] 50 |     Some(root)
[INFO] [stdout]    |     ---- ^^^^ expected `Rc<RefCell<TreeNode>>`, found `Option<Rc<RefCell<TreeNode>>>`
[INFO] [stdout]    |     |
[INFO] [stdout]    |     arguments to this enum variant are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Rc<_>`
[INFO] [stdout]                 found enum `Option<Rc<_>>`
[INFO] [stdout] help: the type constructed contains `Option<Rc<RefCell<bst::TreeNode>>>` due to the type of the argument passed
[INFO] [stdout]   --> src/month_1/week2/trees/bfs/medium/reverse_odd_level.rs:50:5
[INFO] [stdout]    |
[INFO] [stdout] 50 |     Some(root)
[INFO] [stdout]    |     ^^^^^----^
[INFO] [stdout]    |          |
[INFO] [stdout]    |          this argument influences the type of `Some`
[INFO] [stdout] note: tuple variant defined here
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/core/src/option.rs:605:4
[INFO] [stdout] help: use the `?` operator to extract the `Option<Rc<RefCell<bst::TreeNode>>>` value, propagating an `Option::None` value to the caller
[INFO] [stdout]    |
[INFO] [stdout] 50 |     Some(root?)
[INFO] [stdout]    |              +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bfs/medium/reverse_odd_level.rs:50:10
[INFO] [stdout]    |
[INFO] [stdout] 50 |     Some(root)
[INFO] [stdout]    |     ---- ^^^^ expected `Rc<RefCell<TreeNode>>`, found `Option<Rc<RefCell<TreeNode>>>`
[INFO] [stdout]    |     |
[INFO] [stdout]    |     arguments to this enum variant are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Rc<_>`
[INFO] [stdout]                 found enum `Option<Rc<_>>`
[INFO] [stdout] help: the type constructed contains `Option<Rc<RefCell<bst::TreeNode>>>` due to the type of the argument passed
[INFO] [stdout]   --> src/month_1/week2/trees/bfs/medium/reverse_odd_level.rs:50:5
[INFO] [stdout]    |
[INFO] [stdout] 50 |     Some(root)
[INFO] [stdout]    |     ^^^^^----^
[INFO] [stdout]    |          |
[INFO] [stdout]    |          this argument influences the type of `Some`
[INFO] [stdout] note: tuple variant defined here
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/core/src/option.rs:605:4
[INFO] [stdout] help: use the `?` operator to extract the `Option<Rc<RefCell<bst::TreeNode>>>` value, propagating an `Option::None` value to the caller
[INFO] [stdout]    |
[INFO] [stdout] 50 |     Some(root?)
[INFO] [stdout]    |              +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:92:5
[INFO] [stdout]    |
[INFO] [stdout] 88 | fn sweepline(rect: Vec<Vec<i32>>, points: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |                                                             -------- expected `Vec<i32>` because of return type
[INFO] [stdout] ...
[INFO] [stdout] 92 |     for (i, rect) in rect.iter().enumerate() {}
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout]    = note: `for` loops evaluate to unit type `()`
[INFO] [stdout] help: consider returning a value here
[INFO] [stdout]    |
[INFO] [stdout] 92 |     for (i, rect) in rect.iter().enumerate() {} /* `Vec<i32>` value */
[INFO] [stdout]    |                                                 ++++++++++++++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bst/sorted_to_tree.rs:34:16
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn build_bas(nums: &[i32], left: i32, right: i32) {
[INFO] [stdout]    |                                                  - help: a return type might be missing here: `-> _`
[INFO] [stdout] 33 |     if left > right {
[INFO] [stdout] 34 |         return None;
[INFO] [stdout]    |                ^^^^ expected `()`, found `Option<_>`
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected unit type `()`
[INFO] [stdout]                    found enum `Option<_>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bst/sorted_to_tree.rs:40:30
[INFO] [stdout]    |
[INFO] [stdout] 40 |     root.borrow_mut().left = build_bas(nums, left, mid - 1);
[INFO] [stdout]    |     ----------------------   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `Option<Rc<RefCell<TreeNode>>>`, found `()`
[INFO] [stdout]    |     |
[INFO] [stdout]    |     expected due to the type of this binding
[INFO] [stdout]    |
[INFO] [stdout]    = note:   expected enum `Option<Rc<RefCell<bst::TreeNode>>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bst/sorted_to_tree.rs:41:31
[INFO] [stdout]    |
[INFO] [stdout] 41 |     root.borrow_mut().right = build_bas(nums, left, right);
[INFO] [stdout]    |     -----------------------   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `Option<Rc<RefCell<TreeNode>>>`, found `()`
[INFO] [stdout]    |     |
[INFO] [stdout]    |     expected due to the type of this binding
[INFO] [stdout]    |
[INFO] [stdout]    = note:   expected enum `Option<Rc<RefCell<bst::TreeNode>>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:92:5
[INFO] [stdout]    |
[INFO] [stdout] 88 | fn sweepline(rect: Vec<Vec<i32>>, points: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |                                                             -------- expected `Vec<i32>` because of return type
[INFO] [stdout] ...
[INFO] [stdout] 92 |     for (i, rect) in rect.iter().enumerate() {}
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout]    = note: `for` loops evaluate to unit type `()`
[INFO] [stdout] help: consider returning a value here
[INFO] [stdout]    |
[INFO] [stdout] 92 |     for (i, rect) in rect.iter().enumerate() {} /* `Vec<i32>` value */
[INFO] [stdout]    |                                                 ++++++++++++++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/correspoinding_node.rs:19:68
[INFO] [stdout]    |
[INFO] [stdout] 19 |             if let Some(node) = dfs_parallel(&o_b.left, &c_b.left, target) {
[INFO] [stdout]    |                                 ------------                       ^^^^^^ expected `&Option<Rc<RefCell<TreeNode>>>`, found `&Rc<RefCell<TreeNode>>`
[INFO] [stdout]    |                                 |
[INFO] [stdout]    |                                 arguments to this function are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected reference `&Option<Rc<_>>`
[INFO] [stdout]               found reference `&Rc<_>`
[INFO] [stdout] note: function defined here
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/correspoinding_node.rs:9:4
[INFO] [stdout]    |
[INFO] [stdout]  9 | fn dfs_parallel(original: &TreeType, cloned: &TreeType, target: &TreeType) -> TreeType {
[INFO] [stdout]    |    ^^^^^^^^^^^^                                         -----------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/correspoinding_node.rs:22:50
[INFO] [stdout]    |
[INFO] [stdout] 22 |             dfs_parallel(&o_b.right, &c_b.right, target)
[INFO] [stdout]    |             ------------                         ^^^^^^ expected `&Option<Rc<RefCell<TreeNode>>>`, found `&Rc<RefCell<TreeNode>>`
[INFO] [stdout]    |             |
[INFO] [stdout]    |             arguments to this function are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected reference `&Option<Rc<_>>`
[INFO] [stdout]               found reference `&Rc<_>`
[INFO] [stdout] note: function defined here
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/correspoinding_node.rs:9:4
[INFO] [stdout]    |
[INFO] [stdout]  9 | fn dfs_parallel(original: &TreeType, cloned: &TreeType, target: &TreeType) -> TreeType {
[INFO] [stdout]    |    ^^^^^^^^^^^^                                         -----------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bst/sorted_to_tree.rs:34:16
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn build_bas(nums: &[i32], left: i32, right: i32) {
[INFO] [stdout]    |                                                  - help: a return type might be missing here: `-> _`
[INFO] [stdout] 33 |     if left > right {
[INFO] [stdout] 34 |         return None;
[INFO] [stdout]    |                ^^^^ expected `()`, found `Option<_>`
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected unit type `()`
[INFO] [stdout]                    found enum `Option<_>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bst/sorted_to_tree.rs:40:30
[INFO] [stdout]    |
[INFO] [stdout] 40 |     root.borrow_mut().left = build_bas(nums, left, mid - 1);
[INFO] [stdout]    |     ----------------------   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `Option<Rc<RefCell<TreeNode>>>`, found `()`
[INFO] [stdout]    |     |
[INFO] [stdout]    |     expected due to the type of this binding
[INFO] [stdout]    |
[INFO] [stdout]    = note:   expected enum `Option<Rc<RefCell<bst::TreeNode>>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/bst/sorted_to_tree.rs:41:31
[INFO] [stdout]    |
[INFO] [stdout] 41 |     root.borrow_mut().right = build_bas(nums, left, right);
[INFO] [stdout]    |     -----------------------   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `Option<Rc<RefCell<TreeNode>>>`, found `()`
[INFO] [stdout]    |     |
[INFO] [stdout]    |     expected due to the type of this binding
[INFO] [stdout]    |
[INFO] [stdout]    = note:   expected enum `Option<Rc<RefCell<bst::TreeNode>>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0282]: type annotations needed for `Vec<_>`
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/medium/cousins_in_bin_tree.rs:12:13
[INFO] [stdout]    |
[INFO] [stdout] 12 |         let mut new_queue = vec![];
[INFO] [stdout]    |             ^^^^^^^^^^^^^   ------ type must be known at this point
[INFO] [stdout]    |
[INFO] [stdout] help: consider giving `new_queue` an explicit type, where the placeholder `_` is specified
[INFO] [stdout]    |
[INFO] [stdout] 12 |         let mut new_queue: Vec<_> = vec![];
[INFO] [stdout]    |                          ++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/correspoinding_node.rs:19:68
[INFO] [stdout]    |
[INFO] [stdout] 19 |             if let Some(node) = dfs_parallel(&o_b.left, &c_b.left, target) {
[INFO] [stdout]    |                                 ------------                       ^^^^^^ expected `&Option<Rc<RefCell<TreeNode>>>`, found `&Rc<RefCell<TreeNode>>`
[INFO] [stdout]    |                                 |
[INFO] [stdout]    |                                 arguments to this function are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected reference `&Option<Rc<_>>`
[INFO] [stdout]               found reference `&Rc<_>`
[INFO] [stdout] note: function defined here
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/correspoinding_node.rs:9:4
[INFO] [stdout]    |
[INFO] [stdout]  9 | fn dfs_parallel(original: &TreeType, cloned: &TreeType, target: &TreeType) -> TreeType {
[INFO] [stdout]    |    ^^^^^^^^^^^^                                         -----------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/correspoinding_node.rs:22:50
[INFO] [stdout]    |
[INFO] [stdout] 22 |             dfs_parallel(&o_b.right, &c_b.right, target)
[INFO] [stdout]    |             ------------                         ^^^^^^ expected `&Option<Rc<RefCell<TreeNode>>>`, found `&Rc<RefCell<TreeNode>>`
[INFO] [stdout]    |             |
[INFO] [stdout]    |             arguments to this function are incorrect
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected reference `&Option<Rc<_>>`
[INFO] [stdout]               found reference `&Rc<_>`
[INFO] [stdout] note: function defined here
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/easy/correspoinding_node.rs:9:4
[INFO] [stdout]    |
[INFO] [stdout]  9 | fn dfs_parallel(original: &TreeType, cloned: &TreeType, target: &TreeType) -> TreeType {
[INFO] [stdout]    |    ^^^^^^^^^^^^                                         -----------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0282]: type annotations needed for `Vec<_>`
[INFO] [stdout]   --> src/month_1/week2/trees/dfs/medium/cousins_in_bin_tree.rs:12:13
[INFO] [stdout]    |
[INFO] [stdout] 12 |         let mut new_queue = vec![];
[INFO] [stdout]    |             ^^^^^^^^^^^^^   ------ type must be known at this point
[INFO] [stdout]    |
[INFO] [stdout] help: consider giving `new_queue` an explicit type, where the placeholder `_` is specified
[INFO] [stdout]    |
[INFO] [stdout] 12 |         let mut new_queue: Vec<_> = vec![];
[INFO] [stdout]    |                          ++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trie/easy/max_sxor_strong_pair.rs:47:9
[INFO] [stdout]    |
[INFO] [stdout] 43 |       fn find_max_xor(&self, num: i32) -> i32 {
[INFO] [stdout]    |                                           --- expected `i32` because of return type
[INFO] [stdout] ...
[INFO] [stdout] 47 | /         for i in (0..31).rev() {
[INFO] [stdout] 48 | |             let bit = ((num >> i) & 1) as usize;
[INFO] [stdout] 49 | |             let opp_bit = 1 - bit;
[INFO] [stdout] ...  |
[INFO] [stdout] 55 | |         }
[INFO] [stdout]    | |_________^ expected `i32`, found `()`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `for` loops evaluate to unit type `()`
[INFO] [stdout] help: consider returning a value here
[INFO] [stdout]    |
[INFO] [stdout] 55 ~         }
[INFO] [stdout] 56 +         /* `i32` value */
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_1/week2/trie/easy/max_sxor_strong_pair.rs:47:9
[INFO] [stdout]    |
[INFO] [stdout] 43 |       fn find_max_xor(&self, num: i32) -> i32 {
[INFO] [stdout]    |                                           --- expected `i32` because of return type
[INFO] [stdout] ...
[INFO] [stdout] 47 | /         for i in (0..31).rev() {
[INFO] [stdout] 48 | |             let bit = ((num >> i) & 1) as usize;
[INFO] [stdout] 49 | |             let opp_bit = 1 - bit;
[INFO] [stdout] ...  |
[INFO] [stdout] 55 | |         }
[INFO] [stdout]    | |_________^ expected `i32`, found `()`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `for` loops evaluate to unit type `()`
[INFO] [stdout] help: consider returning a value here
[INFO] [stdout]    |
[INFO] [stdout] 55 ~         }
[INFO] [stdout] 56 +         /* `i32` value */
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_1/week4/heaps/medium/maze.rs:1:91
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn shortest_distance(maze: Vec<Vec<i32>>, start: Vec<Vec<i32>>, destination: Vec<i32>) -> i32 {}
[INFO] [stdout]   |    -----------------                                                                      ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_1/week4/heaps/medium/maze.rs:1:91
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn shortest_distance(maze: Vec<Vec<i32>>, start: Vec<Vec<i32>>, destination: Vec<i32>) -> i32 {}
[INFO] [stdout]   |    -----------------                                                                      ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_2/dp/medium/beautiful_towers_2.rs:1:49
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn beautiful_towers_2(max_heights: Vec<i32>) -> i64 {
[INFO] [stdout]   |    ------------------                           ^^^ expected `i64`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_2/dp/medium/secret.rs:1:51
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn secret(n : i32 ,delay : i32 , forget : i32) -> i32 {
[INFO] [stdout]   |    ------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `verify_additive` in this scope
[INFO] [stdout]   --> src/month_2/dp/medium/additive_number.rs:23:16
[INFO] [stdout]    |
[INFO] [stdout] 23 |             if verify_additive(&num, len1, len2) {
[INFO] [stdout]    |                ^^^^^^^^^^^^^^^ not found in this scope
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_2/dp/medium/number_of_restricted.rs:1:58
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn number_of_restricted(n: i32, edges: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    --------------------                                  ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout] help: consider returning the local binding `n`
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn number_of_restricted(n: i32, edges: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout] 2 ~     n
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_2/dp/medium/beautiful_towers_2.rs:1:49
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn beautiful_towers_2(max_heights: Vec<i32>) -> i64 {
[INFO] [stdout]   |    ------------------                           ^^^ expected `i64`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_2/dp/medium/secret.rs:1:51
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn secret(n : i32 ,delay : i32 , forget : i32) -> i32 {
[INFO] [stdout]   |    ------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find function `verify_additive` in this scope
[INFO] [stdout]   --> src/month_2/dp/medium/additive_number.rs:23:16
[INFO] [stdout]    |
[INFO] [stdout] 23 |             if verify_additive(&num, len1, len2) {
[INFO] [stdout]    |                ^^^^^^^^^^^^^^^ not found in this scope
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_2/dp/medium/number_of_restricted.rs:1:58
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn number_of_restricted(n: i32, edges: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    --------------------                                  ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout] help: consider returning the local binding `n`
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn number_of_restricted(n: i32, edges: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout] 2 ~     n
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0277]: the trait bound `String: Borrow<i32>` is not satisfied
[INFO] [stdout]   --> src/month_2/topological_sort/all_possible_recipes.rs:21:36
[INFO] [stdout]    |
[INFO] [stdout] 21 |             if supply_set.contains(ingredient) {
[INFO] [stdout]    |                           -------- ^^^^^^^^^^ the trait `Borrow<i32>` is not implemented for `String`
[INFO] [stdout]    |                           |
[INFO] [stdout]    |                           required by a bound introduced by this call
[INFO] [stdout]    |
[INFO] [stdout] help: the trait `Borrow<i32>` is not implemented for `String`
[INFO] [stdout]       but trait `Borrow<str>` is implemented for it
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/alloc/src/str.rs:229:0
[INFO] [stdout]    = help: for that trait implementation, expected `str`, found `i32`
[INFO] [stdout] note: required by a bound in `HashSet::<T, S, A>::contains`
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/std/src/collections/hash/set.rs:806:4
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0277]: the trait bound `String: Borrow<i32>` is not satisfied
[INFO] [stdout]   --> src/month_2/topological_sort/all_possible_recipes.rs:24:69
[INFO] [stdout]    |
[INFO] [stdout] 24 |             } else if let Some(&dep_recipe_idx) = recipe_to_idx.get(ingredient) {
[INFO] [stdout]    |                                                                 --- ^^^^^^^^^^ the trait `Borrow<i32>` is not implemented for `String`
[INFO] [stdout]    |                                                                 |
[INFO] [stdout]    |                                                                 required by a bound introduced by this call
[INFO] [stdout]    |
[INFO] [stdout] help: the trait `Borrow<i32>` is not implemented for `String`
[INFO] [stdout]       but trait `Borrow<str>` is implemented for it
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/alloc/src/str.rs:229:0
[INFO] [stdout]    = help: for that trait implementation, expected `str`, found `i32`
[INFO] [stdout] note: required by a bound in `HashMap::<K, V, S, A>::get`
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/std/src/collections/hash/map.rs:1035:4
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0277]: the trait bound `String: Borrow<i32>` is not satisfied
[INFO] [stdout]   --> src/month_2/topological_sort/all_possible_recipes.rs:21:36
[INFO] [stdout]    |
[INFO] [stdout] 21 |             if supply_set.contains(ingredient) {
[INFO] [stdout]    |                           -------- ^^^^^^^^^^ the trait `Borrow<i32>` is not implemented for `String`
[INFO] [stdout]    |                           |
[INFO] [stdout]    |                           required by a bound introduced by this call
[INFO] [stdout]    |
[INFO] [stdout] help: the trait `Borrow<i32>` is not implemented for `String`
[INFO] [stdout]       but trait `Borrow<str>` is implemented for it
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/alloc/src/str.rs:229:0
[INFO] [stdout]    = help: for that trait implementation, expected `str`, found `i32`
[INFO] [stdout] note: required by a bound in `HashSet::<T, S, A>::contains`
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/std/src/collections/hash/set.rs:806:4
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0277]: the trait bound `String: Borrow<i32>` is not satisfied
[INFO] [stdout]   --> src/month_2/topological_sort/all_possible_recipes.rs:24:69
[INFO] [stdout]    |
[INFO] [stdout] 24 |             } else if let Some(&dep_recipe_idx) = recipe_to_idx.get(ingredient) {
[INFO] [stdout]    |                                                                 --- ^^^^^^^^^^ the trait `Borrow<i32>` is not implemented for `String`
[INFO] [stdout]    |                                                                 |
[INFO] [stdout]    |                                                                 required by a bound introduced by this call
[INFO] [stdout]    |
[INFO] [stdout] help: the trait `Borrow<i32>` is not implemented for `String`
[INFO] [stdout]       but trait `Borrow<str>` is implemented for it
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/alloc/src/str.rs:229:0
[INFO] [stdout]    = help: for that trait implementation, expected `str`, found `i32`
[INFO] [stdout] note: required by a bound in `HashMap::<K, V, S, A>::get`
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/std/src/collections/hash/map.rs:1035:4
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_3/shortest_path/min_time_reach_last_room.rs:73:42
[INFO] [stdout]    |
[INFO] [stdout] 73 |             if nx < 0 || ny < 0 || nx >= n || ny >= m {
[INFO] [stdout]    |                                    --    ^ expected `isize`, found `usize`
[INFO] [stdout]    |                                    |
[INFO] [stdout]    |                                    expected because this is `isize`
[INFO] [stdout]    |
[INFO] [stdout] help: you can convert a `usize` to an `isize` and panic if the converted value doesn't fit
[INFO] [stdout]    |
[INFO] [stdout] 73 |             if nx < 0 || ny < 0 || nx >= n.try_into().unwrap() || ny >= m {
[INFO] [stdout]    |                                           ++++++++++++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_3/shortest_path/min_time_reach_last_room.rs:73:53
[INFO] [stdout]    |
[INFO] [stdout] 73 |             if nx < 0 || ny < 0 || nx >= n || ny >= m {
[INFO] [stdout]    |                                               --    ^ expected `isize`, found `usize`
[INFO] [stdout]    |                                               |
[INFO] [stdout]    |                                               expected because this is `isize`
[INFO] [stdout]    |
[INFO] [stdout] help: you can convert a `usize` to an `isize` and panic if the converted value doesn't fit
[INFO] [stdout]    |
[INFO] [stdout] 73 |             if nx < 0 || ny < 0 || nx >= n || ny >= m.try_into().unwrap() {
[INFO] [stdout]    |                                                      ++++++++++++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_3/shortest_path/min_time_reach_last_room.rs:73:42
[INFO] [stdout]    |
[INFO] [stdout] 73 |             if nx < 0 || ny < 0 || nx >= n || ny >= m {
[INFO] [stdout]    |                                    --    ^ expected `isize`, found `usize`
[INFO] [stdout]    |                                    |
[INFO] [stdout]    |                                    expected because this is `isize`
[INFO] [stdout]    |
[INFO] [stdout] help: you can convert a `usize` to an `isize` and panic if the converted value doesn't fit
[INFO] [stdout]    |
[INFO] [stdout] 73 |             if nx < 0 || ny < 0 || nx >= n.try_into().unwrap() || ny >= m {
[INFO] [stdout]    |                                           ++++++++++++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/month_3/shortest_path/min_time_reach_last_room.rs:73:53
[INFO] [stdout]    |
[INFO] [stdout] 73 |             if nx < 0 || ny < 0 || nx >= n || ny >= m {
[INFO] [stdout]    |                                               --    ^ expected `isize`, found `usize`
[INFO] [stdout]    |                                               |
[INFO] [stdout]    |                                               expected because this is `isize`
[INFO] [stdout]    |
[INFO] [stdout] help: you can convert a `usize` to an `isize` and panic if the converted value doesn't fit
[INFO] [stdout]    |
[INFO] [stdout] 73 |             if nx < 0 || ny < 0 || nx >= n || ny >= m.try_into().unwrap() {
[INFO] [stdout]    |                                                      ++++++++++++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_3/shortest_path/min_max_edge_weight.rs:1:73
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_max_edge_weight(n: i32, edges: Vec<Vec<i32>>, threshold: i32) -> i32 {
[INFO] [stdout]   |    -------------------                                                  ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout] note: consider returning one of these bindings
[INFO] [stdout]  --> src/month_3/shortest_path/min_max_edge_weight.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_max_edge_weight(n: i32, edges: Vec<Vec<i32>>, threshold: i32) -> i32 {
[INFO] [stdout]   |                        ^                             ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/month_3/shortest_path/min_max_edge_weight.rs:1:73
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_max_edge_weight(n: i32, edges: Vec<Vec<i32>>, threshold: i32) -> i32 {
[INFO] [stdout]   |    -------------------                                                  ^^^ expected `i32`, found `()`
[INFO] [stdout]   |    |
[INFO] [stdout]   |    implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout] note: consider returning one of these bindings
[INFO] [stdout]  --> src/month_3/shortest_path/min_max_edge_weight.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_max_edge_weight(n: i32, edges: Vec<Vec<i32>>, threshold: i32) -> i32 {
[INFO] [stdout]   |                        ^                             ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `start`
[INFO] [stdout]   --> src/backtracking/medium/combination_sum_3.rs:12:5
[INFO] [stdout]    |
[INFO] [stdout] 12 |     start: i32,
[INFO] [stdout]    |     ^^^^^ help: if this is intentional, prefix it with an underscore: `_start`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `start`
[INFO] [stdout]   --> src/backtracking/medium/combination_sum_3.rs:12:5
[INFO] [stdout]    |
[INFO] [stdout] 12 |     start: i32,
[INFO] [stdout]    |     ^^^^^ help: if this is intentional, prefix it with an underscore: `_start`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0382]: borrow of moved value: `nums`
[INFO] [stdout]   --> src/backtracking/medium/permutations_2.rs:58:17
[INFO] [stdout]    |
[INFO] [stdout] 51 |     fn perm(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |             ---- move occurs because `nums` has type `Vec<i32>`, which does not implement the `Copy` trait
[INFO] [stdout] 52 |         let mut freq_map = HashMap::new();
[INFO] [stdout] 53 |         for num in nums {
[INFO] [stdout]    |                    ---- `nums` moved due to this implicit call to `.into_iter()`
[INFO] [stdout] ...
[INFO] [stdout] 58 |         let n = nums.len();
[INFO] [stdout]    |                 ^^^^ value borrowed here after move
[INFO] [stdout]    |
[INFO] [stdout] note: `into_iter` takes ownership of the receiver `self`, which moves `nums`
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/core/src/iter/traits/collect.rs:312:17
[INFO] [stdout] help: consider iterating over a slice of the `Vec<i32>`'s content to avoid moving into the `for` loop
[INFO] [stdout]    |
[INFO] [stdout] 53 |         for num in &nums {
[INFO] [stdout]    |                    +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0382]: borrow of moved value: `nums`
[INFO] [stdout]   --> src/backtracking/medium/permutations_2.rs:58:17
[INFO] [stdout]    |
[INFO] [stdout] 51 |     fn perm(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |             ---- move occurs because `nums` has type `Vec<i32>`, which does not implement the `Copy` trait
[INFO] [stdout] 52 |         let mut freq_map = HashMap::new();
[INFO] [stdout] 53 |         for num in nums {
[INFO] [stdout]    |                    ---- `nums` moved due to this implicit call to `.into_iter()`
[INFO] [stdout] ...
[INFO] [stdout] 58 |         let n = nums.len();
[INFO] [stdout]    |                 ^^^^ value borrowed here after move
[INFO] [stdout]    |
[INFO] [stdout] note: `into_iter` takes ownership of the receiver `self`, which moves `nums`
[INFO] [stdout]   --> /rustc/622891a4e29178280638a6b63a8908bde2c0c854/library/core/src/iter/traits/collect.rs:312:17
[INFO] [stdout] help: consider iterating over a slice of the `Vec<i32>`'s content to avoid moving into the `for` loop
[INFO] [stdout]    |
[INFO] [stdout] 53 |         for num in &nums {
[INFO] [stdout]    |                    +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/month_1/week1/ll/singly/medium/rotate_right.rs:5:17
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn rotate_right(mut head: LinkedListNode, k: i32) -> LinkedListNode {
[INFO] [stdout]   |                 ----^^^^
[INFO] [stdout]   |                 |
[INFO] [stdout]   |                 help: remove this `mut`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/month_1/week1/ll/singly/medium/rotate_right.rs:5:17
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn rotate_right(mut head: LinkedListNode, k: i32) -> LinkedListNode {
[INFO] [stdout]   |                 ----^^^^
[INFO] [stdout]   |                 |
[INFO] [stdout]   |                 help: remove this `mut`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `next_node`
[INFO] [stdout]   --> src/month_1/week1/ll/singly/medium/flatten_dfs.rs:36:13
[INFO] [stdout]    |
[INFO] [stdout] 36 |         let next_node = curr_ref.next.clone();
[INFO] [stdout]    |             ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_next_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `next_node`
[INFO] [stdout]   --> src/month_1/week1/ll/singly/medium/flatten_dfs.rs:36:13
[INFO] [stdout]    |
[INFO] [stdout] 36 |         let next_node = curr_ref.next.clone();
[INFO] [stdout]    |             ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_next_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow `self.url_to_id` as mutable, as it is behind a `&` reference
[INFO] [stdout]   --> src/month_1/week1/strings/medium/encode_decode.rs:33:9
[INFO] [stdout]    |
[INFO] [stdout] 33 |         self.url_to_id.insert(long_url.clone(), id);
[INFO] [stdout]    |         ^^^^^^^^^^^^^^ `self` is a `&` reference, so it cannot be borrowed as mutable
[INFO] [stdout]    |
[INFO] [stdout] help: consider changing this to be a mutable reference
[INFO] [stdout]    |
[INFO] [stdout] 24 |     fn encode(&mut self, long_url: String) -> String {
[INFO] [stdout]    |                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow `self.id_to_url` as mutable, as it is behind a `&` reference
[INFO] [stdout]   --> src/month_1/week1/strings/medium/encode_decode.rs:34:9
[INFO] [stdout]    |
[INFO] [stdout] 34 |         self.id_to_url.insert(id, long_url);
[INFO] [stdout]    |         ^^^^^^^^^^^^^^ `self` is a `&` reference, so it cannot be borrowed as mutable
[INFO] [stdout]    |
[INFO] [stdout] help: consider changing this to be a mutable reference
[INFO] [stdout]    |
[INFO] [stdout] 24 |     fn encode(&mut self, long_url: String) -> String {
[INFO] [stdout]    |                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/month_1/week1/strings/medium/encode_decode.rs:106:13
[INFO] [stdout]     |
[INFO] [stdout] 106 |         let mut og_code = code;
[INFO] [stdout]     |             ----^^^^^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0382]: borrow of moved value: `code`
[INFO] [stdout]    --> src/month_1/week1/strings/medium/encode_decode.rs:108:45
[INFO] [stdout]     |
[INFO] [stdout] 104 |         let mut code = self.hash_to_base64(hash);
[INFO] [stdout]     |             -------- move occurs because `code` has type `String`, which does not implement the `Copy` trait
[INFO] [stdout] 105 |         let mut counter = 0;
[INFO] [stdout] 106 |         let mut og_code = code;
[INFO] [stdout]     |                           ---- value moved here
[INFO] [stdout] 107 |
[INFO] [stdout] 108 |         while self.code_to_url.contains_key(&code) {
[INFO] [stdout]     |                                             ^^^^^ value borrowed here after move
[INFO] [stdout]     |
[INFO] [stdout] help: consider cloning the value if the performance cost is acceptable
[INFO] [stdout]     |
[INFO] [stdout] 106 |         let mut og_code = code.clone();
[INFO] [stdout]     |                               ++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow `self.url_to_id` as mutable, as it is behind a `&` reference
[INFO] [stdout]   --> src/month_1/week1/strings/medium/encode_decode.rs:33:9
[INFO] [stdout]    |
[INFO] [stdout] 33 |         self.url_to_id.insert(long_url.clone(), id);
[INFO] [stdout]    |         ^^^^^^^^^^^^^^ `self` is a `&` reference, so it cannot be borrowed as mutable
[INFO] [stdout]    |
[INFO] [stdout] help: consider changing this to be a mutable reference
[INFO] [stdout]    |
[INFO] [stdout] 24 |     fn encode(&mut self, long_url: String) -> String {
[INFO] [stdout]    |                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow `self.id_to_url` as mutable, as it is behind a `&` reference
[INFO] [stdout]   --> src/month_1/week1/strings/medium/encode_decode.rs:34:9
[INFO] [stdout]    |
[INFO] [stdout] 34 |         self.id_to_url.insert(id, long_url);
[INFO] [stdout]    |         ^^^^^^^^^^^^^^ `self` is a `&` reference, so it cannot be borrowed as mutable
[INFO] [stdout]    |
[INFO] [stdout] help: consider changing this to be a mutable reference
[INFO] [stdout]    |
[INFO] [stdout] 24 |     fn encode(&mut self, long_url: String) -> String {
[INFO] [stdout]    |                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/month_1/week1/strings/medium/encode_decode.rs:106:13
[INFO] [stdout]     |
[INFO] [stdout] 106 |         let mut og_code = code;
[INFO] [stdout]     |             ----^^^^^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0382]: borrow of moved value: `code`
[INFO] [stdout]    --> src/month_1/week1/strings/medium/encode_decode.rs:108:45
[INFO] [stdout]     |
[INFO] [stdout] 104 |         let mut code = self.hash_to_base64(hash);
[INFO] [stdout]     |             -------- move occurs because `code` has type `String`, which does not implement the `Copy` trait
[INFO] [stdout] 105 |         let mut counter = 0;
[INFO] [stdout] 106 |         let mut og_code = code;
[INFO] [stdout]     |                           ---- value moved here
[INFO] [stdout] 107 |
[INFO] [stdout] 108 |         while self.code_to_url.contains_key(&code) {
[INFO] [stdout]     |                                             ^^^^^ value borrowed here after move
[INFO] [stdout]     |
[INFO] [stdout] help: consider cloning the value if the performance cost is acceptable
[INFO] [stdout]     |
[INFO] [stdout] 106 |         let mut og_code = code.clone();
[INFO] [stdout]     |                               ++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/month_1/week2/queue/med/num_ppl_secret.rs:2:19
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn num_ppl_secret(n: i32, delay: i32, forget: i32) -> i32 {
[INFO] [stdout]   |                   ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `delay`
[INFO] [stdout]  --> src/month_1/week2/queue/med/num_ppl_secret.rs:2:27
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn num_ppl_secret(n: i32, delay: i32, forget: i32) -> i32 {
[INFO] [stdout]   |                           ^^^^^ help: if this is intentional, prefix it with an underscore: `_delay`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `forget`
[INFO] [stdout]  --> src/month_1/week2/queue/med/num_ppl_secret.rs:2:39
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn num_ppl_secret(n: i32, delay: i32, forget: i32) -> i32 {
[INFO] [stdout]   |                                       ^^^^^^ help: if this is intentional, prefix it with an underscore: `_forget`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/month_1/week2/queue/med/num_ppl_secret.rs:2:19
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn num_ppl_secret(n: i32, delay: i32, forget: i32) -> i32 {
[INFO] [stdout]   |                   ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `delay`
[INFO] [stdout]  --> src/month_1/week2/queue/med/num_ppl_secret.rs:2:27
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn num_ppl_secret(n: i32, delay: i32, forget: i32) -> i32 {
[INFO] [stdout]   |                           ^^^^^ help: if this is intentional, prefix it with an underscore: `_delay`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `forget`
[INFO] [stdout]  --> src/month_1/week2/queue/med/num_ppl_secret.rs:2:39
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn num_ppl_secret(n: i32, delay: i32, forget: i32) -> i32 {
[INFO] [stdout]   |                                       ^^^^^^ help: if this is intentional, prefix it with an underscore: `_forget`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:87:9
[INFO] [stdout]    |
[INFO] [stdout] 87 |     let mut iterator = BSTIterator::new(root);
[INFO] [stdout]    |         ----^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `iterator`
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:87:9
[INFO] [stdout]    |
[INFO] [stdout] 87 |     let mut iterator = BSTIterator::new(root);
[INFO] [stdout]    |         ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_iterator`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:87:9
[INFO] [stdout]    |
[INFO] [stdout] 87 |     let mut iterator = BSTIterator::new(root);
[INFO] [stdout]    |         ----^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `iterator`
[INFO] [stdout]   --> src/month_1/week2/stack/medium/bst_iterator.rs:87:9
[INFO] [stdout]    |
[INFO] [stdout] 87 |     let mut iterator = BSTIterator::new(root);
[INFO] [stdout]    |         ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_iterator`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `r`
[INFO] [stdout]   --> src/month_1/week2/trees/bin_search_tree/medium/delete_node.rs:96:24
[INFO] [stdout]    |
[INFO] [stdout] 96 |         (Some(l), Some(r)) => {
[INFO] [stdout]    |                        ^ help: if this is intentional, prefix it with an underscore: `_r`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `r`
[INFO] [stdout]   --> src/month_1/week2/trees/bin_search_tree/medium/delete_node.rs:96:24
[INFO] [stdout]    |
[INFO] [stdout] 96 |         (Some(l), Some(r)) => {
[INFO] [stdout]    |                        ^ help: if this is intentional, prefix it with an underscore: `_r`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:52:9
[INFO] [stdout]    |
[INFO] [stdout] 52 |     let mut count = 0;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:54:9
[INFO] [stdout]    |
[INFO] [stdout] 54 |     let mut left_smaller = vec![0; n];
[INFO] [stdout]    |         ----^^^^^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:55:9
[INFO] [stdout]    |
[INFO] [stdout] 55 |     let mut left_larger = vec![0; n];
[INFO] [stdout]    |         ----^^^^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `compress`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:49:9
[INFO] [stdout]    |
[INFO] [stdout] 49 |     let compress = |val: i32| -> usize { sorted_ratings.binary_search(&val).unwrap() + 1 };
[INFO] [stdout]    |         ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_compress`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `max_rating`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:51:9
[INFO] [stdout]    |
[INFO] [stdout] 51 |     let max_rating = sorted_ratings.len();
[INFO] [stdout]    |         ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_rating`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `left_smaller`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:54:9
[INFO] [stdout]    |
[INFO] [stdout] 54 |     let mut left_smaller = vec![0; n];
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left_smaller`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `left_larger`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:55:9
[INFO] [stdout]    |
[INFO] [stdout] 55 |     let mut left_larger = vec![0; n];
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left_larger`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `y`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:81:34
[INFO] [stdout]    |
[INFO] [stdout] 81 |             Event::RecStart { x, y, rect_id } => *x,
[INFO] [stdout]    |                                  ^ help: try ignoring the field: `y: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `rect_id`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:81:37
[INFO] [stdout]    |
[INFO] [stdout] 81 |             Event::RecStart { x, y, rect_id } => *x,
[INFO] [stdout]    |                                     ^^^^^^^ help: try ignoring the field: `rect_id: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `y`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:82:32
[INFO] [stdout]    |
[INFO] [stdout] 82 |             Event::RecEnd { x, y, rect_id } => *x,
[INFO] [stdout]    |                                ^ help: try ignoring the field: `y: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `rect_id`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:82:35
[INFO] [stdout]    |
[INFO] [stdout] 82 |             Event::RecEnd { x, y, rect_id } => *x,
[INFO] [stdout]    |                                   ^^^^^^^ help: try ignoring the field: `rect_id: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `y`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:83:36
[INFO] [stdout]    |
[INFO] [stdout] 83 |             Event::PointQuery { x, y, point_id } => *x,
[INFO] [stdout]    |                                    ^ help: try ignoring the field: `y: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `point_id`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:83:39
[INFO] [stdout]    |
[INFO] [stdout] 83 |             Event::PointQuery { x, y, point_id } => *x,
[INFO] [stdout]    |                                       ^^^^^^^^ help: try ignoring the field: `point_id: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:52:9
[INFO] [stdout]    |
[INFO] [stdout] 52 |     let mut count = 0;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:54:9
[INFO] [stdout]    |
[INFO] [stdout] 54 |     let mut left_smaller = vec![0; n];
[INFO] [stdout]    |         ----^^^^^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:55:9
[INFO] [stdout]    |
[INFO] [stdout] 55 |     let mut left_larger = vec![0; n];
[INFO] [stdout]    |         ----^^^^^^^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `compress`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:49:9
[INFO] [stdout]    |
[INFO] [stdout] 49 |     let compress = |val: i32| -> usize { sorted_ratings.binary_search(&val).unwrap() + 1 };
[INFO] [stdout]    |         ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_compress`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `max_rating`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:51:9
[INFO] [stdout]    |
[INFO] [stdout] 51 |     let max_rating = sorted_ratings.len();
[INFO] [stdout]    |         ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_rating`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `left_smaller`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:54:9
[INFO] [stdout]    |
[INFO] [stdout] 54 |     let mut left_smaller = vec![0; n];
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left_smaller`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `left_larger`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/count_no_of_teams.rs:55:9
[INFO] [stdout]    |
[INFO] [stdout] 55 |     let mut left_larger = vec![0; n];
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left_larger`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `y`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:81:34
[INFO] [stdout]    |
[INFO] [stdout] 81 |             Event::RecStart { x, y, rect_id } => *x,
[INFO] [stdout]    |                                  ^ help: try ignoring the field: `y: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `rect_id`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:81:37
[INFO] [stdout]    |
[INFO] [stdout] 81 |             Event::RecStart { x, y, rect_id } => *x,
[INFO] [stdout]    |                                     ^^^^^^^ help: try ignoring the field: `rect_id: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `y`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:82:32
[INFO] [stdout]    |
[INFO] [stdout] 82 |             Event::RecEnd { x, y, rect_id } => *x,
[INFO] [stdout]    |                                ^ help: try ignoring the field: `y: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `rect_id`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:82:35
[INFO] [stdout]    |
[INFO] [stdout] 82 |             Event::RecEnd { x, y, rect_id } => *x,
[INFO] [stdout]    |                                   ^^^^^^^ help: try ignoring the field: `rect_id: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `y`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:83:36
[INFO] [stdout]    |
[INFO] [stdout] 83 |             Event::PointQuery { x, y, point_id } => *x,
[INFO] [stdout]    |                                    ^ help: try ignoring the field: `y: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `point_id`
[INFO] [stdout]   --> src/month_1/week2/trees/bindexedtree/no_of_rectangles.rs:83:39
[INFO] [stdout]    |
[INFO] [stdout] 83 |             Event::PointQuery { x, y, point_id } => *x,
[INFO] [stdout]    |                                       ^^^^^^^^ help: try ignoring the field: `point_id: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn merge_two_bin_trees(mut root1: TreeType, root2: TreeType) -> TreeType {
[INFO] [stdout]   |                        ----^^^^^
[INFO] [stdout]   |                        |
[INFO] [stdout]   |                        help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:12:21
[INFO] [stdout]    |
[INFO] [stdout] 12 |                 let mut borrowed1 = node1.borrow();
[INFO] [stdout]    |                     ----^^^^^^^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0594]: cannot assign to data in dereference of `Ref<'_, bst::TreeNode>`
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:13:17
[INFO] [stdout]    |
[INFO] [stdout] 13 |                 borrowed1.val += borrowed2.val;
[INFO] [stdout]    |                 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ cannot assign
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0594]: cannot assign to data in dereference of `Ref<'_, bst::TreeNode>`
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:15:17
[INFO] [stdout]    |
[INFO] [stdout] 15 |                 borrowed1.left = merge_two_bin_trees(borrowed1.left.take(), borrowed2.left.clone());
[INFO] [stdout]    |                 ^^^^^^^^^^^^^^ cannot assign
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow data in dereference of `Ref<'_, bst::TreeNode>` as mutable
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:15:54
[INFO] [stdout]    |
[INFO] [stdout] 15 |                 borrowed1.left = merge_two_bin_trees(borrowed1.left.take(), borrowed2.left.clone());
[INFO] [stdout]    |                                                      ^^^^^^^^^^^^^^ cannot borrow as mutable
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0594]: cannot assign to data in dereference of `Ref<'_, bst::TreeNode>`
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:16:17
[INFO] [stdout]    |
[INFO] [stdout] 16 |                 borrowed1.right =
[INFO] [stdout]    |                 ^^^^^^^^^^^^^^^ cannot assign
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow data in dereference of `Ref<'_, bst::TreeNode>` as mutable
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:17:41
[INFO] [stdout]    |
[INFO] [stdout] 17 |                     merge_two_bin_trees(borrowed1.right.take(), borrowed2.right.clone());
[INFO] [stdout]    |                                         ^^^^^^^^^^^^^^^ cannot borrow as mutable
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn merge_two_bin_trees(mut root1: TreeType, root2: TreeType) -> TreeType {
[INFO] [stdout]   |                        ----^^^^^
[INFO] [stdout]   |                        |
[INFO] [stdout]   |                        help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:12:21
[INFO] [stdout]    |
[INFO] [stdout] 12 |                 let mut borrowed1 = node1.borrow();
[INFO] [stdout]    |                     ----^^^^^^^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0594]: cannot assign to data in dereference of `Ref<'_, bst::TreeNode>`
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:13:17
[INFO] [stdout]    |
[INFO] [stdout] 13 |                 borrowed1.val += borrowed2.val;
[INFO] [stdout]    |                 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ cannot assign
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0594]: cannot assign to data in dereference of `Ref<'_, bst::TreeNode>`
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:15:17
[INFO] [stdout]    |
[INFO] [stdout] 15 |                 borrowed1.left = merge_two_bin_trees(borrowed1.left.take(), borrowed2.left.clone());
[INFO] [stdout]    |                 ^^^^^^^^^^^^^^ cannot assign
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow data in dereference of `Ref<'_, bst::TreeNode>` as mutable
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:15:54
[INFO] [stdout]    |
[INFO] [stdout] 15 |                 borrowed1.left = merge_two_bin_trees(borrowed1.left.take(), borrowed2.left.clone());
[INFO] [stdout]    |                                                      ^^^^^^^^^^^^^^ cannot borrow as mutable
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0594]: cannot assign to data in dereference of `Ref<'_, bst::TreeNode>`
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:16:17
[INFO] [stdout]    |
[INFO] [stdout] 16 |                 borrowed1.right =
[INFO] [stdout]    |                 ^^^^^^^^^^^^^^^ cannot assign
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow data in dereference of `Ref<'_, bst::TreeNode>` as mutable
[INFO] [stdout]   --> src/month_1/week2/trees/jtrees/merge_two_bin_trees.rs:17:41
[INFO] [stdout]    |
[INFO] [stdout] 17 |                     merge_two_bin_trees(borrowed1.right.take(), borrowed2.right.clone());
[INFO] [stdout]    |                                         ^^^^^^^^^^^^^^^ cannot borrow as mutable
[INFO] [stdout]    |
[INFO] [stdout]    = help: trait `DerefMut` is required to modify through a dereference, but it is not implemented for `Ref<'_, bst::TreeNode>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]  --> src/month_1/week4/heaps/easy/min_number_game.rs:6:10
[INFO] [stdout]   |
[INFO] [stdout] 6 |     for (i, &num) in nums.iter().enumerate() {
[INFO] [stdout]   |          ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]  --> src/month_1/week4/heaps/easy/min_number_game.rs:6:10
[INFO] [stdout]   |
[INFO] [stdout] 6 |     for (i, &num) in nums.iter().enumerate() {
[INFO] [stdout]   |          ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `piles`
[INFO] [stdout]  --> src/month_2/dp/medium/stones_1.rs:1:13
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn stones_1(piles: Vec<i32>) -> bool {
[INFO] [stdout]   |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_piles`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `piles`
[INFO] [stdout]  --> src/month_2/dp/medium/stones_1.rs:1:13
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn stones_1(piles: Vec<i32>) -> bool {
[INFO] [stdout]   |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_piles`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `dist`
[INFO] [stdout]   --> src/month_3/shortest_path/min_time_reach_last_room.rs:17:29
[INFO] [stdout]    |
[INFO] [stdout] 17 |     while let Some(Reverse((dist, x, y))) = q.pop() {
[INFO] [stdout]    |                             ^^^^ help: if this is intentional, prefix it with an underscore: `_dist`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `dist`
[INFO] [stdout]   --> src/month_3/shortest_path/min_time_reach_last_room.rs:17:29
[INFO] [stdout]    |
[INFO] [stdout] 17 |     while let Some(Reverse((dist, x, y))) = q.pop() {
[INFO] [stdout]    |                             ^^^^ help: if this is intentional, prefix it with an underscore: `_dist`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0277, E0282, E0308, E0382, E0425, E0592, E0594, E0596, E0599...
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0277`.
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0277, E0282, E0308, E0382, E0425, E0592, E0594, E0596, E0599...
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0277`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `top_interview_150_1` (lib) due to 45 previous errors; 48 warnings emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stderr] error: could not compile `top_interview_150_1` (lib test) due to 45 previous errors; 48 warnings emitted
[INFO] running `Command { std: "docker" "inspect" "fcef6ed6c7be26e538501302a073e9dc7bdb202cf4d9cb6c3769c33a3b7e46c5", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "fcef6ed6c7be26e538501302a073e9dc7bdb202cf4d9cb6c3769c33a3b7e46c5", kill_on_drop: false }`
[INFO] [stdout] fcef6ed6c7be26e538501302a073e9dc7bdb202cf4d9cb6c3769c33a3b7e46c5
